6. Conclusion 5. Route Planning

نویسنده

  • Taylor Francis
چکیده

and the destination points are in different maps. For instance, bus-stop T3 can be reached from C1 by highway line H2 (or H1) to C3 and then by bus trip R1: S 22 (C1H2) ∧ S 34 (C3H2) ∧ T 22 (C3R1) ∧ T 23 (T3R1). Additional types of connections can be defined to express situations involving routes from a station to another. In procedural terms the previous definitions reduce to a search for intersections. Direction information can be used in choosing a line which is in the direction of the destination, when several choices are available. This paper describes how symbolic spatial indexes can be used in several computational tasks involving direction and topological relations in 2D space. In particular we have dealt with spatial information retrieval, composition of spatial relations, route planning and update operations. Several extensions can be developed to increase the applicability of the concepts presented in the paper. For instance, PQBE can be extended with the inclusion of topological expressions for queries of the form " Show the route from station C5 to T1 that involves the smallest number of intermediate connection ". The composition operator can also be extended to handle composition of both direction and topological relations. Although these problems have been studied independently (e.g., a study about composition of topological relations can be found in Egenhofer, 1991), to our knowledge there does not exist previous work that combines both approaches. There are also additional application domains where symbolic spatial indexes can be used. Lee et al. (1992) developed algorithms for image similarity retrieval based on variations of 2D strings. Similar algorithms can be developed for spatial indexes. Information processing using spatial indexes, and relation-based representations in general, involves symbolic and not numerical computation and avoids the usual problems of geometric representations, like finite resolution and geometric consistency. Although relation-based systems cannot be used in all applications involving spatial knowledge (e.g., applications involving quantitative reasoning and visualisation), we believe that there is a wide scope of potential applications ranging from Qualitative Spatial Reasoning and Spatial Databases to Robot Navigation and Computational Vision. A system which can only represent direction relations in 2D space is inadequate for several practical applications that also involve neighbourhood, inclusion, overlap or other topological queries. In this section we will show how we can use symbolic spatial indexes that incorporate direction and topological information in route planning. Previous systems …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

North is up(hill): route planning heuristics in real-world environments.

Navigators use both external cues and internal heuristics to help them plan efficient routes through environments. In six experiments, we discover and seek the origin of a novel heuristic that causes participants to preferentially choose southern rather than northern routes during map-based route planning. Experiment 1 demonstrates that participants who are tasked to choose between two equal-le...

متن کامل

TRANSPORT ROUTE PLANNING MODELS BASED ON FUZZY APPROACH

Transport route planning is one of the most important and frequent activities in supply chain management. The design of information systems for route planning in real contexts faces two relevant challenges: the complexity of the planning and the lack of complete and precise information. The purpose of this paper is to nd methods for the development of transport route planning in uncertainty dec...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

Modeling different decision strategies in a time tabled multimodal route planning by integrating the quantifier-guided OWA operators, fuzzy AHP weighting method and TOPSIS

The purpose of Multi-modal Multi-criteria Personalized Route Planning (MMPRP) is to provide an optimal route between an origin-destination pair by considering weights of effective criteria in a way this route can be a combination of public and private modes of transportation. In this paper, the fuzzy analytical hierarchy process (fuzzy AHP) and the quantifier-guided ordered weighted averaging (...

متن کامل

Robust algorithm for real-time route planning

Route planning is an important problem for a number of diverse applications including intelligent transportation systems, space applications, autonomous robotics, and military guidance and navigation systems [1, 4, 5, 9—11]. We address the routing problem in the context of route planning for aircraft (rotorcraft or fixed-wing, manned or unmanned), though our approach can be easily extended to t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994